Two derivative-free optimization algorithms for mesh quality improvement
نویسندگان
چکیده
منابع مشابه
Two derivative-free optimization algorithms for mesh quality improvement
High-quality meshes are essential in the solution of partial differential equations (PDEs), which arise in numerous science and engineering applications, as the mesh quality affects the solution accuracy, the solver execution time, and the problem conditioning. Mesh quality improvement is necessary when the mesh is of less than desirable quality (either from mesh generation or deformation). Non...
متن کاملBenchmarking Derivative-Free Optimization Algorithms
We propose data profiles as a tool for analyzing the performance of derivativefree optimization solvers when there are constraints on the computational budget. We use performance and data profiles, together with a convergence test that measures the decrease in function value, to analyze the performance of three solvers on sets of smooth, noisy, and piecewise-smooth problems. Our results provide...
متن کاملExperimental Comparisons of Derivative Free Optimization Algorithms
— In this paper, the performances of the quasi-Newton BFGS algorithm, the NEWUOA derivative free optimizer, the Covariance Matrix Adaptation Evolution Strategy (CMA-ES), the Differential Evolution (DE) algorithm and Particle Swarm Optimizers (PSO) are compared experimentally on benchmark functions reflecting important challenges encountered in real-world optimization problems. Dependence of the...
متن کاملFairer Benchmarking of Optimization Algorithms via Derivative Free Optimization
Research in optimization algorithm design is often accompanied by benchmarking a new algorithm. Some benchmarking is done as a proof-of-concept, by demonstrating the new algorithm works on a small number of difficult test problems. Alternately, some benchmarking is done in order to demonstrate that the new algorithm in someway out-performs previous methods. In this circumstance it is important ...
متن کاملDerivative Free Trust Region Algorithms for Stochastic Optimization
In this article we study the following stochastic optimization problem. Let (Ω,F ,P) be a probability space. Let ζ(ω) (where ω denotes a generic element of Ω) be a random variable on (Ω,F ,P), taking values in the probability space (Ξ,G,Q), where Q denotes the probability measure of ζ. Suppose for some open set E ⊂ R, F : E × Ξ → R is a real-valued function such that for each x ∈ E , F (x, ·) :...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2010
ISSN: 1877-0509
DOI: 10.1016/j.procs.2010.04.042